bulling and farwer
On the Boundary of (Un)decidability: Decidable Model-Checking for a Fragment of Resource Agent Logic
Alechina, Natasha (University of Nottingham) | Bulling, Nils (Delft University of Technology) | Logan, Brian (University of Nottingham) | Nguyen, Hoang Nga (University of Nottingham)
This choice, which is also related to the finitary and infinitary The model-checking problem for Resource Agent semantics of [Bulling and Farwer, 2010], stipulates whether Logic is known to be undecidable. We review existing in every model, agents always have a choice of doing nothing (un)decidability results and identify a significant (executing an idle action) that produces and consumes fragment of the logic for which model checking no resources [Alechina et al., 2014]. Apart from the technical is decidable. We discuss aspects which makes convenience for model-checking (intuitively it implies model checking decidable and prove undecidability that any strategy to satisfy a next or until formula only needs of two open fragments over a class of models in to ensure the relevant subformula becomes true after finitely which agents always have a choice of doing nothing.